Track Drawings of Graphs with Constant Queue Number
نویسندگان
چکیده
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In [18] it is proved that every graph from a proper minor closed family has constant track number if and only if it has constant queue number. In this paper we study the track number of well-known families of graphs with small queue number. For these families we show upper bounds and lower bounds on the track number that significantly improve previous results in the literature. Linear time algorithms that compute track drawings of these graphs are also presented and their volume complexity is discussed.
منابع مشابه
Computing straight-line 3D grid drawings of graphs in linear volume
This paper investigates the basic problem of computing crossing-free straight-line 3D grid drawings of graphs such that the overall volume is small. Motivated by their relevance in the literature, we focus on families of graphs having constant queue number and on k-trees. We present algorithms that compute drawings of these families of graphs on 3D grids consisting of a constant number of paral...
متن کاملLayout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number. A threedimensional (straight-line grid) drawing of a graph represents the vertices by points in Z and the edges by non-crossing line-segments. This paper ...
متن کاملLayouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of a vertex k-colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The sta...
متن کاملLayouts for Plane Graphs on Constant Number of Tracks
A k-track layout of a graph consists of a vertex k colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set are nested with respect to the vertex ordering. The track numb...
متن کاملTree-Partitions of k-Trees with Applications in Graph Layout
A tree-partition of a graph is a partition of its vertices into ‘bags’ such that contracting each bag into a single vertex gives a forest (after deleting loops and replacing parallel edges by a single edge). It is proved that every k-tree has a tree-partition such that each bag induces a (k 1)-tree, amongst other properties. Applications of this result to two well-studied models of graph layout...
متن کامل